首页> 外文OA文献 >A Distributed Max-Min Flow Control Algorithm for Multi-rate Multicast Flows
【2h】

A Distributed Max-Min Flow Control Algorithm for Multi-rate Multicast Flows

机译:多速率组播流的分布式最大-最小流控制算法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

We present a distributed algorithm to compute bandwidth max-min fair rates in a multi-rate multicast network. The significance of the algorithm, compared to previous algorithms [1], [21, [3], is that it is more scalable in that it does not require each link to maintain the saturation status of all sessions and virtual sessions travelling through it, more stable in that it converges asymptotically to the desired equilibrium satisfying the minimum plus max-min fairness even in presence of heterogeneous round-trip delays, and has explicit link buffer control in that the buffer occupancy of every bottlenecked link in the network asymptotically converges to the pre-defined value. In addition, we propose an efficient feedback consolidation algorithm which is computationally simpler than its hard-synchronization based counterpart and eliminates unnecessary consolidation delay by preventing it from awaiting backward control packets(BCPs) that do not directly contribute to the session rate. Through simulations we verity the performance of the proposed multi-rate multicast flow control scheme based on these two algorithms.
机译:我们提出了一种分布式算法来计算多速率组播网络中的带宽最大-最小公平速率。与先前的算法[1],[21,[3]相比,该算法的重要性在于它具有更高的可扩展性,因为它不需要每个链接来维持所有通过它的会话和虚拟会话的饱和状态,更加稳定,即使在存在异构往返延迟的情况下,它也渐近收敛到满足最小和最大-最小公平性的所需平衡,并且具有显式的链路缓冲区控制,因为网络中每个瓶颈链路的缓冲区占用都渐近收敛为预定义值。此外,我们提出了一种高效的反馈合并算法,该算法比基于硬同步的同类算法在计算上更简单,并且通过防止等待等待对会话速率没有直接贡献的反向控制数据包(BCP),消除了不必要的合并延迟。通过仿真,我们验证了基于这两种算法的多速率组播流控制方案的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号